Inapproximability Results for the Closest Vector Problem with Preprocessing over infty Norm
نویسندگان
چکیده
We show that the Closest Vector Problem with Preprocessing over `∞ norm (CVPP∞) is NP-hard to approximate to within a factor of (log n)1/2− , unless NP⊆ DTIME (2polylog(n)). The result is the same as that in [19] by Regev and Rosen, but our proof methods are different from theirs. Their reductions are based on norm embeddings. However, our reductions are based on the reduction of [2] and the property of Hadamard matrix.
منابع مشابه
Faster algorithms for SVP and CVP in the $\ell_{\infty}$ norm
Blomer and Naewe[BN09] modified the randomized sieving algorithm of Ajtai, Kumar and Sivakumar[AKS01] to solve the shortest vector problem (SVP). The algorithm starts with $N = 2^{O(n)}$ randomly chosen vectors in the lattice and employs a sieving procedure to iteratively obtain shorter vectors in the lattice. The running time of the sieving procedure is quadratic in $N$. We study this problem ...
متن کاملROBUST $H_{infty}$ CONTROL FOR T–S TIME-VARYING DELAY SYSTEMS WITH NORM BOUNDED UNCERTAINTY BASED ON LMI APPROACH
In this paper we consider the problem of delay-dependent robustH1 control for uncertain fuzzy systems with time-varying delay. The Takagi–Sugeno (T–S) fuzzy model is used to describe such systems. Time-delay isassumed to have lower and upper bounds. Based on the Lyapunov-Krasovskiifunctional method, a sufficient condition for the existence of a robust $H_{infty}$controller is obtained. The fuzz...
متن کاملA new sequence space and norm of certain matrix operators on this space
In the present paper, we introduce the sequence space [{l_p}(E,Delta) = left{ x = (x_n)_{n = 1}^infty : sum_{n = 1}^infty left| sum_{j in {E_n}} x_j - sum_{j in E_{n + 1}} x_jright| ^p < infty right},] where $E=(E_n)$ is a partition of finite subsets of the positive integers and $pge 1$. We investigate its topological properties and inclusion relations. Moreover, we consider the problem of fin...
متن کاملInapproximability Reductions and Integrality Gaps
In this thesis we prove intractability results for several well studied problems in combinatorial optimization. Closest Vector Problem with Pre-processing (CVPP): We show that the pre-processing version of the well known Closest Vector Problem is hard to approximate to an almost polynomial factor (2 1− ) unless NP is in quasi polynomial time. The approximability of CVPP is closely related to th...
متن کاملSimple Construction of a Frame which is $epsilon$-nearly Parseval and $epsilon$-nearly Unit Norm
In this paper, we will provide a simple method for starting with a given finite frame for an $n$-dimensional Hilbert space $mathcal{H}_n$ with nonzero elements and producing a frame which is $epsilon$-nearly Parseval and $epsilon$-nearly unit norm. Also, the concept of the $epsilon$-nearly equal frame operators for two given frames is presented. Moreover, we characterize all bounded invertible ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 13 شماره
صفحات -
تاریخ انتشار 2006